Gerhard J. Woeginger
10 publications
7 venues
H Index 7
Affiliation
RWTH Aachen University, Department of Computer Science, GermanyEindhoven University of Technology, Department of Mathematics and Computer Science, The Netherlands
Humboldt Prize
Links
DBLPGoogle Scholar
ORCID- https://algo.rwth-aachen.de/~woeginger/
- http://www.win.tue.nl/~gwoegi/
- https://dl.acm.org/profile/81100554696
- https://zbmath.org/authors/?q=ai:woeginger.gerhard-j
- https://mathgenealogy.org/id.php?id=56410
- https://en.wikipedia.org/wiki/Gerhard_J._Woeginger
- https://www.wikidata.org/entity/Q20994323
- http://isni.org/isni/0000000116317852
- https://id.loc.gov/authorities/names/n97074329
- https://d-nb.info/gnd/1055771131
- https://mathscinet.ams.org/mathscinet/MRAuthorID/278345
- https://dblp.uni-trier.de/pers/hd/w/Woeginger:Gerhard_Johannes
| Name | Venue | Year | citations |
|---|---|---|---|
Committee Selection with Intraclass and Interclass Synergies.
|
AAAI | 2018 | 11 |
| The Subset Sum Game Revisited.
|
ADT | 2017 | 1 |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
|
JAIR | 2014 | 0 |
| How to Put through Your Agenda in Collective Binary Decisions.
|
ADT | 2013 | 8 |
| Are There Any Nicely Structured Preference Profiles Nearby?
|
IJCAI | 2013 | 69 |
| Group Activity Selection Problem.
|
WINE | 2012 | 71 |
| Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.
|
IJCAI | 2011 | 93 |
| How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?
|
WINE | 2008 | 8 |
| On the Complexity of Function Learning.
|
MLJ | 1995 | 0 |
| On the Complexity of Function Learning.
|
COLT | 1993 | 10 |